Extended smoothing joint data association for multi‐target tracking in cluttered environments
نویسندگان
چکیده
منابع مشابه
Generalized Data Association for Multitarget Tracking in Clutter
The objective of this chapter is to present an approach for target tracking in cluttered environment, which incorporates the advanced concept of generalized data (kinematics and attribute) association (GDA) to improve track maintenance performance in complicated situations (closely spaced and/or crossing targets), when kinematics data are insufficient for correct decision making. It uses Global...
متن کاملApproximation Algorithms for Data Association Problem Arising from Multitarget Tracking
In this paper, we discuss a data association problem arising from multitarget tracking. We formulate the problem as a multi-dimensional assignment problem and propose a polynomial time 1.8-approximation algorithm for simple case. We also propose a 3.7approximation algorithm for general cases.
متن کاملMultitarget Tracking By Distributed Cooperative Processing ( Extended
Exploiting a new distributed cooperative processing scheme where multiple processors cooperate in finding a global minimum, we have developed a new efficient maximum likelihood-based calculation method for multitarget motion analysis under a fixed networked multisensor environment. The marked improvement in computational efficiency and also in stability is achieved by replacing the well known H...
متن کاملSmoothing with Measurement Information Retrodictions in Cluttered Environments
This paper presents a smoothing data association algorithm for a single target tracking in clutter. The proposed algorithm fuses the forward estimates and all the available measurement information retrodictions (but not backward track estimates) within the smoothing window to obtain the smoothed estimates. The measurement information retrodictions are obtained using the one-step-backward inform...
متن کاملCollision-Free and Curvature-Continuous Path Smoothing In Cluttered Environments
We present a novel trajectory computation algorithm to smooth jerky collision-free paths computed by samplebased motion planners. Our approach uses cubic B-splines to generate G or curvature continuous trajectories. The algorithm performs local spline refinement to compute smooth, collision-free paths in narrow passages and satisfy velocity and acceleration constraints. We also present a fast a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Radar, Sonar & Navigation
سال: 2020
ISSN: 1751-8792,1751-8792
DOI: 10.1049/iet-rsn.2019.0075